Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
نویسندگان
چکیده
We give tail estimates for the efficiency of some randomized incremental algorithms for line segment intersection in the plane. In particular, we show that there is a constant C such that the probability that the running times of algorithms due to Mulmuley [Mul88] and Clarkson and Shor [CS89] exceed C times their expected time is bounded by e ln n)) where n is the number of segments, m is the number of intersections, and m ≥ n ln n ln n.
منابع مشابه
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
We show that the well-known random incremental construction of Clarkson and Shor can be adapted to provide efficient external-memory algorithms for some geometric problems. In particular, as the main result, we obtain an optimal randomized algorithm for the problem of computing the trapezoidal decomposition determined by a set of N line segments in the plane with K pairwise intersections, that ...
متن کاملImplementatations of Algorithms For Line-Segment Intersection
In this paper, I analyze the constant factors for implementations of line segment intersection algorithms. I explore how these algorithms could be applied to stochastic local search algorithms to determine the rectilinear crossing number of complete graphs.
متن کاملرفع اعوجاج هندسی متون به‌کمک اطلاعات هندسی خطوط متن
Document images produced by scanners or digital cameras usually have photometric and geometric distortions. If either of these effects distorts document, recognition of words from such a document image using OCR is subject to errors. In this paper we propose a novel approach to significantly remove geometric distortion from document images. In this method first we extract document lines from do...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملDynamic Segment Intersection Search with Applications
In this paper, we consider two restricted types of dynamic orthogonal segment intersection search problems. One is the problem in which the underlying set is updated only by insertions. In the other, the set is updated only by deletions. We show that an intermixed sequence of O ( n ) queries and updates in both problems can be executed on-line in O(n1ognSK) time and O(n1ogn) space, where K is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 3 شماره
صفحات -
تاریخ انتشار 1993